Solving a Cutting-stock Problem with the Constraint Logic Programming Language Chip

CHIP is a new constraint logic programnu ‘ng language combining the declarative aspect of logic progranuni ng with the efficiency of constraint manipulation techniques. In the present paper, we show an application of CHIP to a two-dimensional cutting stock problem. This problem is highly combinatorial and is generally solved by specific programs written in procedural languages. We present two approaches to solve this problem in CHIP and compare them with the standard ones. It turns out that, although CHIP greatly simplifies the problem statement, it is comparable in efficiency to specialized programs. Of particular interest is the ability to use symbolic constraints to prune the search space.